We concentrate on the analysis of the busy period and the waiting time distribution of a multi-server retrial queue in which primary arrivals occur according to a Markovian arrival process (MAP). Since the study of a model with an infinite retrial group seems intractable, we deal with a system having a finite buffer for the retrial group. The system is analyzed in steady state by deriving expressions for (a) the Laplace–Stieltjes transforms of the busy period and the waiting time; (b) the probabiliy generating functions for the number of customers served during a busy period and the number of retrials made by a customer; and (c) various moments of quantites of interest. Some illustrative numerical examples are discussed.\ud\ud
展开▼
机译：我们专注于对多服务器重试队列的繁忙时段和等待时间分布的分析，其中根据马尔可夫到达过程（MAP）发生主要到达。由于研究具有无限重试组的模型似乎很棘手，因此我们要处理一个具有有限重试组缓冲区的系统。通过导出以下表达式来对系统进行稳态分析：（a）繁忙时段和等待时间的Laplace-Stieltjes变换； （b）为繁忙时段服务的客户数量和客户重试次数提供的概率生成功能； （c）感兴趣的各个时刻。讨论了一些说明性的数值示例。\ ud \ ud
展开▼
